Interval Arithmetic over Finitely Many Endpoints

نویسنده

  • SIEGFRIED M. RUMP
چکیده

To my knowledge all definitions of interval arithmetic start with real endpoints and prove properties. Then, for practical use, the definition is specialized to finitely many endpoints, where many of the mathematical properties are no longer valid. There seems no treatment how to choose this finite set of endpoints to preserve as many mathematical properties as possible. Here we define interval endpoints directly using a finite set which, for example, may be based on the IEEE 754 floating-point standard. The corresponding interval operations emerge naturally from the corresponding power set operations. We present necessary and sufficient conditions on this finite set to ensure desirable mathematical properties, many of which are not satisfied by other definitions. For example, an interval product contains zero if and only if one of the factors does. The key feature of the theoretical foundation is that “endpoints” of intervals are not points but non-overlapping closed, half-open or open intervals, each of which can be regarded as an atomic object. By using non-closed intervals among its “endpoints”, intervals containing “arbitrarily large” and “arbitrarily close to but not equal to” a real number can be handled. The latter may be zero defining “tiny” numbers, but also any other quantity including transcendental numbers. Our scheme can be implemented straightforwardly using the IEEE 754 floating-point standard.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Univalent holomorphic functions with fixed finitely many coefficients involving Salagean operator

By using generalized Salagean differential operator a newclass of univalent holomorphic functions with fixed finitely manycoefficients is defined. Coefficient estimates, extreme points,arithmetic mean, and weighted mean properties are investigated.

متن کامل

More on Decomposing Coverings by Octants

In this note we improve our upper bound given in [7] by showing that every 9-fold covering of a point set in R by finitely many translates of an octant decomposes into two coverings, and our lower bound by a construction for a 4-fold covering that does not decompose into two coverings. We also prove that certain dynamic interval coloring problems are equivalent to the above question. The same b...

متن کامل

The Dynamical Mordell-lang Conjecture in Positive Characteristic

Let K be an algebraically closed field of prime characteristic p, let N ∈ N, let Φ : Gm −→ Gm be a self-map defined over K, let V ⊂ Gm be a curve defined over K, and let α ∈ Gm(K). We show that the set S = {n ∈ N : Φn(α) ∈ V } is a union of finitely many arithmetic progressions, along with a finite set and finitely many p-arithmetic sequences, which are sets of the form {a+ bpkn : n ∈ N} for so...

متن کامل

Topological and Geometric Properties of Interval Solid Models

A solid is a connected orientable compact subset of R 3 which is a 3-manifold with boundary. Moreover, its boundary consists of finitely many components, each of which being a subset of the union of finitely many almost smooth surfaces. Motivated by numerical robustness issues, we consider a finite collection of boxes, with faces parallel to the coordinate planes, which covers the boundary of t...

متن کامل

Computing discrete logarithm by interval-valued paradigm

Interval-valued computing is a relatively new computing paradigm. It uses finitely many interval segments over the unit interval in a computation as data structure. The satisfiability of Quantified Boolean formulae and other hard problems, like integer factorization, can be solved in an effective way by its massive parallelism. The discrete logarithm problem plays an important role in practice,...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012